An OO Application that introduces Heuristic Algorithm Design.
نویسندگان
چکیده
منابع مشابه
Application of a Revised DIT Metric to Redesign an OO Design
In this paper, we continue a series of papers that discuss specific design metrics [Alkadi 1999] [Alkadi 2000] [Alkadi 2001] [Alkadi 1998]. The design metric discussed in this paper is the Depth of Inheritance [DIT] metric. Design evaluation is a recurring step that should be performed and checked multiple times before committing to the final design implementation. Metrics are utilized to evalu...
متن کاملLAO*: A heuristic search algorithm that finds solutions with loops
Classic heuristic search algorithms can find solutions that take the form of a simple path (A*), a tree, or an acyclic graph (AO*). In this paper, we describe a novel generalization of heuristic search, called LAO*, that can find solutions with loops. We show that LAO* can be used to solve Markov decision problems and that it shares the advantage heuristic search has over dynamic programming fo...
متن کاملDesign of Manufacturing Cells with Two- Phase Model and A Heuristic Algorithm
A Two-phase model for configuring a cellular manufacturing system is proposed. In phase (I), for the first time, number of cells is considered as a decision variable. In phase (II), pursing two different objectives, one minimization of underload and the other, maximization of similarity of parts within a group, the design procedure is performed. As one cannot have these two objects together, a ...
متن کاملOPTIMUM DESIGN OF REINFORCED CONCRETE FRAMES USING BAT META-HEURISTIC ALGORITHM
The main aim of the present study is to achieve optimum design of reinforced concrete (RC) plane moment frames using bat algorithm (BA) which is a newly developed meta-heuristic optimization algorithm based on the echolocation behaviour of bats. The objective function is the total cost of the frame and the design constraints are checked during the optimization process based on ACI 318-08 code. ...
متن کاملAn Iterative Heuristic Algorithm for Tree Decomposition
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem and different algorithms have been proposed in the literature for generation of tree decompositions of small width. In this paper is presented new iterated local search algorithm to find good upper bounds for treewidth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Object Technology
سال: 2002
ISSN: 1660-1769
DOI: 10.5381/jot.2002.1.2.c6